Algorithm 69. Two distances between hypergraphs
نویسندگان
چکیده
منابع مشابه
Two-coloring Random Hypergraphs
A 2-coloring of a hypergraph is a mapping from its vertex set to a set of two colors such that no edge is monochromatic. Let H = H k n p be a random k-uniform hypergraph on a vertex set V of cardinality n, where each k-subset of V is an edge of H with probability p, independently of all other k-subsets. Let m = p(n k ) denote the expected number of edges in H. Let us say that a sequence of even...
متن کاملAdditive Distances and Quasi-Distances Between Words
We study additive distances and quasi-distances between words. We show that every additive distance is finite. We then prove that every additive quasi-distance is regularity-preserving, that is, the neighborhood of any radius of a regular language with respect to an additive quasi-distance is regular. Finally, similar results will be proven for context-free, computable and computably enumerable...
متن کاملTwo-regular subgraphs of hypergraphs
We prove that the maximum number of edges in a k-uniform hypergraph on n vertices containing no 2-regular subhypergraph is ( n−1 k−1 ) if k ≥ 4 is even and n is sufficiently large. Equality holds only if all edges contain a specific vertex v. For odd k we conjecture that this maximum is ( n−1 k−1 ) + bn−1 k c, with equality only for the hypergraph described above plus a maximum matching omittin...
متن کاملDistances between Banach spaces
Abstraca. The main object of the paper is to study the distance betwecn Banach spaces introduced by Kadets. For Banach spaccs Xand y. thc lGders distancc is denned to be rhe infimum of the Hausdorfl distance d(Bx, rr) betwecn the respoctive closed unit balls over all isomctric linear embeddings of f and yinto a common Banach space Z. This is comparcd with the Gromov-Hausdorff distance which is ...
متن کاملProbabilistic Distances Between Trees
Most existing measures of distance between phylogenetic trees are based on the geometry or topology of the trees. Instead, we consider distance measures which are based on the underlying probability distributions on genetic sequence data induced by trees. Monte Carlo schemes are necessary to calculate these distances approximately, and we describe efficient sampling procedures. Key features of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicationes Mathematicae
سال: 1980
ISSN: 1233-7234,1730-6280
DOI: 10.4064/am-16-4-671-679